Relational style laws and constructs of linear algebra
نویسندگان
چکیده
We present a few laws of linear algebra inspired by laws of relation algebra. The linear algebra laws are obtained from the relational ones by replacing union, intersection, composition and converse by the linear algebra operators of addition, Hadamard product, composition and transposition. Many of the modified expressions hold directly or with minor alterations. We also define operators that sum up the content of rows and columns. These share many properties with the relational domain and codomain operators returning a subidentity corresponding to the domain and codomain of a relation. Finally, we use the linear algebra operators to write axioms defining direct sums and direct products and we show that there are other solutions in addition to the traditional —in the relational context— injection and projection relations.
منابع مشابه
Fine-grained Provenance for Linear Algebra Operators
Provenance is well-understood for relational query operators. Increasingly, however, data analytics is incorporating operations expressed through linear algebra: machine learning operations, network centrality measures, and so on. In this paper, we study provenance information for matrix data and linear algebra operations. Our core technique builds upon provenance for aggregate queries and cons...
متن کاملPreference Queries
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and extraction to reduce the volume of data presented to the user. They are also used to keep track of user profiles and formulate policies to improve and automate decision making. We propose here a simple, logical framewor...
متن کاملIteration Mechanisms
The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of sets to be directly applied to bags without losing tractability. We study two constructs for controlling tractability of iteration over bags. The deeationary xpoint construct keeps removing elements from a bag until a xpoint is ...
متن کاملLocal Variable Scoping and Kleene Algebra with Tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We provide (i) a fully compositional relational semantics for a first-order programming language with constructs for local variable declaration and destructive update; and (ii) an equational proof system based on Kleene alge...
متن کاملSymmetry group, Hamiltonian equations and conservation laws of general three-dimensional anisotropic non-linear sourceless heat transfer equation
In this paper Lie point symmetries, Hamiltonian equations and conservation laws of general three-dimensional anisotropic non-linear sourceless heat transfer equation are investigated. First of all Lie symmetries are obtained by using the general method based on invariance condition of a system of differential equations under a prolonged vector field. Then the structure of symmetry ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Algebr. Meth. Program.
دوره 83 شماره
صفحات -
تاریخ انتشار 2014